0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : run_E %s %d THM
0.13/0.33	% Computer : n008.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit   : 960
0.13/0.33	% WCLimit    : 120
0.13/0.33	% DateTime   : Tue Aug  9 06:54:24 EDT 2022
0.13/0.33	% CPUTime    : 
0.19/0.48	Running higher-order on 8 cores theorem proving
0.19/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.48	# Version: 3.0pre003-ho
0.48/0.57	# Preprocessing class: HSLMSMSSLLLCHSA.
0.48/0.57	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
0.48/0.57	# Starting lpo1_fix with 360s (3) cores
0.48/0.57	# Starting full_lambda_9 with 120s (1) cores
0.48/0.57	# Starting almost_fo_4 with 120s (1) cores
0.48/0.57	# Starting new_ho_9 with 120s (1) cores
0.48/0.57	# Starting pre_casc_4 with 120s (1) cores
0.48/0.57	# Starting ho_unfolding_6 with 120s (1) cores
0.48/0.57	# pre_casc_4 with pid 2245 completed with status 0
0.48/0.57	# Result found by pre_casc_4
0.48/0.57	# Preprocessing class: HSLMSMSSLLLCHSA.
0.48/0.57	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
0.48/0.57	# Starting lpo1_fix with 360s (3) cores
0.48/0.57	# Starting full_lambda_9 with 120s (1) cores
0.48/0.57	# Starting almost_fo_4 with 120s (1) cores
0.48/0.57	# Starting new_ho_9 with 120s (1) cores
0.48/0.57	# Starting pre_casc_4 with 120s (1) cores
0.48/0.57	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.48/0.57	# ...ProofStateSinE()=85/358
0.48/0.57	# Search class: HGHSM-FSLM31-DHSMMSBN
0.48/0.57	# partial match(1): HGHSM-FSLM31-MHSMMSBN
0.48/0.57	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.48/0.57	# Starting new_ho_10_cnf2 with 63s (1) cores
0.48/0.57	# new_ho_10_cnf2 with pid 2247 completed with status 0
0.48/0.57	# Result found by new_ho_10_cnf2
0.48/0.57	# Preprocessing class: HSLMSMSSLLLCHSA.
0.48/0.57	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
0.48/0.57	# Starting lpo1_fix with 360s (3) cores
0.48/0.57	# Starting full_lambda_9 with 120s (1) cores
0.48/0.57	# Starting almost_fo_4 with 120s (1) cores
0.48/0.57	# Starting new_ho_9 with 120s (1) cores
0.48/0.57	# Starting pre_casc_4 with 120s (1) cores
0.48/0.57	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.48/0.57	# ...ProofStateSinE()=85/358
0.48/0.57	# Search class: HGHSM-FSLM31-DHSMMSBN
0.48/0.57	# partial match(1): HGHSM-FSLM31-MHSMMSBN
0.48/0.57	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.48/0.57	# Starting new_ho_10_cnf2 with 63s (1) cores
0.48/0.57	# Preprocessing time       : 0.004 s
0.48/0.57	# Presaturation interreduction done
0.48/0.57	
0.48/0.57	# Proof found!
0.48/0.57	# SZS status Theorem
0.48/0.57	# SZS output start CNFRefutation
0.48/0.57	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.48/0.57	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.48/0.57	thf(decl_24, type, eps: ($i > $o) > $i).
0.48/0.57	thf(decl_25, type, in: $i > $i > $o).
0.48/0.57	thf(decl_26, type, d_Subq: $i > $i > $o).
0.48/0.57	thf(decl_27, type, emptyset: $i).
0.48/0.57	thf(decl_28, type, union: $i > $i).
0.48/0.57	thf(decl_29, type, power: $i > $i).
0.48/0.57	thf(decl_30, type, repl: $i > ($i > $i) > $i).
0.48/0.57	thf(decl_31, type, d_Union_closed: $i > $o).
0.48/0.57	thf(decl_32, type, d_Power_closed: $i > $o).
0.48/0.57	thf(decl_33, type, d_Repl_closed: $i > $o).
0.48/0.57	thf(decl_34, type, d_ZF_closed: $i > $o).
0.48/0.57	thf(decl_35, type, univof: $i > $i).
0.48/0.57	thf(decl_36, type, if: $o > $i > $i > $i).
0.48/0.57	thf(decl_37, type, nIn: $i > $i > $o).
0.48/0.57	thf(decl_38, type, d_UPair: $i > $i > $i).
0.48/0.57	thf(decl_39, type, d_Sing: $i > $i).
0.48/0.57	thf(decl_40, type, binunion: $i > $i > $i).
0.48/0.57	thf(decl_41, type, famunion: $i > ($i > $i) > $i).
0.48/0.57	thf(decl_42, type, d_Sep: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_43, type, d_ReplSep: $i > ($i > $o) > ($i > $i) > $i).
0.48/0.57	thf(decl_44, type, setminus: $i > $i > $i).
0.48/0.57	thf(decl_45, type, d_In_rec_G: ($i > ($i > $i) > $i) > $i > $i > $o).
0.48/0.57	thf(decl_46, type, d_In_rec: ($i > ($i > $i) > $i) > $i > $i).
0.48/0.57	thf(decl_47, type, ordsucc: $i > $i).
0.48/0.57	thf(decl_48, type, nat_p: $i > $o).
0.48/0.57	thf(decl_49, type, omega: $i).
0.48/0.57	thf(decl_50, type, d_Inj1: $i > $i).
0.48/0.57	thf(decl_51, type, d_Inj0: $i > $i).
0.48/0.57	thf(decl_52, type, d_Unj: $i > $i).
0.48/0.57	thf(decl_53, type, pair: $i > $i > $i).
0.48/0.57	thf(decl_54, type, proj0: $i > $i).
0.48/0.57	thf(decl_55, type, proj1: $i > $i).
0.48/0.57	thf(decl_56, type, d_Sigma: $i > ($i > $i) > $i).
0.48/0.57	thf(decl_57, type, setprod: $i > $i > $i).
0.48/0.57	thf(decl_58, type, ap: $i > $i > $i).
0.48/0.57	thf(decl_59, type, pair_p: $i > $o).
0.48/0.57	thf(decl_60, type, d_Pi: $i > ($i > $i) > $i).
0.48/0.57	thf(decl_61, type, imp: $o > $o > $o).
0.48/0.57	thf(decl_62, type, d_not: $o > $o).
0.48/0.57	thf(decl_63, type, wel: $o > $o).
0.48/0.57	thf(decl_64, type, obvious: $o).
0.48/0.57	thf(decl_65, type, l_ec: $o > $o > $o).
0.48/0.57	thf(decl_66, type, d_and: $o > $o > $o).
0.48/0.57	thf(decl_67, type, l_or: $o > $o > $o).
0.48/0.57	thf(decl_68, type, orec: $o > $o > $o).
0.48/0.57	thf(decl_69, type, l_iff: $o > $o > $o).
0.48/0.57	thf(decl_70, type, all: $i > ($i > $o) > $o).
0.48/0.57	thf(decl_71, type, non: $i > ($i > $o) > $i > $o).
0.48/0.57	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
0.48/0.57	thf(decl_73, type, or3: $o > $o > $o > $o).
0.48/0.57	thf(decl_74, type, and3: $o > $o > $o > $o).
0.48/0.57	thf(decl_75, type, ec3: $o > $o > $o > $o).
0.48/0.57	thf(decl_76, type, orec3: $o > $o > $o > $o).
0.48/0.57	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.48/0.57	thf(decl_78, type, amone: $i > ($i > $o) > $o).
0.48/0.57	thf(decl_79, type, one: $i > ($i > $o) > $o).
0.48/0.57	thf(decl_80, type, ind: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_81, type, injective: $i > $i > $i > $o).
0.48/0.57	thf(decl_82, type, image: $i > $i > $i > $i > $o).
0.48/0.57	thf(decl_83, type, tofs: $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_84, type, soft: $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_85, type, inverse: $i > $i > $i > $i).
0.48/0.57	thf(decl_86, type, surjective: $i > $i > $i > $o).
0.48/0.57	thf(decl_87, type, bijective: $i > $i > $i > $o).
0.48/0.57	thf(decl_88, type, invf: $i > $i > $i > $i).
0.48/0.57	thf(decl_89, type, inj_h: $i > $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_90, type, e_in: $i > ($i > $o) > $i > $i).
0.48/0.57	thf(decl_91, type, out: $i > ($i > $o) > $i > $i).
0.48/0.57	thf(decl_92, type, d_pair: $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_93, type, first: $i > $i > $i > $i).
0.48/0.57	thf(decl_94, type, second: $i > $i > $i > $i).
0.48/0.57	thf(decl_95, type, prop1: $o > $i > $i > $i > $i > $o).
0.48/0.57	thf(decl_96, type, ite: $o > $i > $i > $i > $i).
0.48/0.57	thf(decl_97, type, wissel_wa: $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_98, type, wissel_wb: $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_99, type, wissel: $i > $i > $i > $i).
0.48/0.57	thf(decl_100, type, changef: $i > $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_101, type, r_ec: $o > $o > $o).
0.48/0.57	thf(decl_102, type, esti: $i > $i > $i > $o).
0.48/0.57	thf(decl_103, type, empty: $i > $i > $o).
0.48/0.57	thf(decl_104, type, nonempty: $i > $i > $o).
0.48/0.57	thf(decl_105, type, incl: $i > $i > $i > $o).
0.48/0.57	thf(decl_106, type, st_disj: $i > $i > $i > $o).
0.48/0.57	thf(decl_107, type, nissetprop: $i > $i > $i > $i > $o).
0.48/0.57	thf(decl_108, type, unmore: $i > $i > $i > $i).
0.48/0.57	thf(decl_109, type, ecelt: $i > ($i > $i > $o) > $i > $i).
0.48/0.57	thf(decl_110, type, ecp: $i > ($i > $i > $o) > $i > $i > $o).
0.48/0.57	thf(decl_111, type, anec: $i > ($i > $i > $o) > $i > $o).
0.48/0.57	thf(decl_112, type, ect: $i > ($i > $i > $o) > $i).
0.48/0.57	thf(decl_113, type, ectset: $i > ($i > $i > $o) > $i > $i).
0.48/0.57	thf(decl_114, type, ectelt: $i > ($i > $i > $o) > $i > $i).
0.48/0.57	thf(decl_115, type, ecect: $i > ($i > $i > $o) > $i > $i).
0.48/0.57	thf(decl_116, type, fixfu: $i > ($i > $i > $o) > $i > $i > $o).
0.48/0.57	thf(decl_117, type, d_10_prop1: $i > ($i > $i > $o) > $i > $i > $i > $i > $i > $o).
0.48/0.57	thf(decl_118, type, prop2: $i > ($i > $i > $o) > $i > $i > $i > $i > $o).
0.48/0.57	thf(decl_119, type, indeq: $i > ($i > $i > $o) > $i > $i > $i > $i).
0.48/0.57	thf(decl_120, type, fixfu2: $i > ($i > $i > $o) > $i > $i > $o).
0.48/0.57	thf(decl_121, type, d_11_i: $i > ($i > $i > $o) > $i > $i > $i > $i).
0.48/0.57	thf(decl_122, type, indeq2: $i > ($i > $i > $o) > $i > $i > $i > $i > $i).
0.48/0.57	thf(decl_123, type, nat: $i).
0.48/0.57	thf(decl_124, type, n_is: $i > $i > $o).
0.48/0.57	thf(decl_125, type, nis: $i > $i > $o).
0.48/0.57	thf(decl_126, type, n_in: $i > $i > $o).
0.48/0.57	thf(decl_127, type, n_some: ($i > $o) > $o).
0.48/0.57	thf(decl_128, type, n_all: ($i > $o) > $o).
0.48/0.57	thf(decl_129, type, n_one: ($i > $o) > $o).
0.48/0.57	thf(decl_130, type, n_1: $i).
0.48/0.57	thf(decl_131, type, cond1: $i > $o).
0.48/0.57	thf(decl_132, type, cond2: $i > $o).
0.48/0.57	thf(decl_133, type, i1_s: ($i > $o) > $i).
0.48/0.57	thf(decl_134, type, d_22_prop1: $i > $o).
0.48/0.57	thf(decl_135, type, d_23_prop1: $i > $o).
0.48/0.57	thf(decl_136, type, d_24_prop1: $i > $o).
0.48/0.57	thf(decl_137, type, d_24_prop2: $i > $i > $o).
0.48/0.57	thf(decl_138, type, prop3: $i > $i > $i > $o).
0.48/0.57	thf(decl_139, type, prop4: $i > $o).
0.48/0.57	thf(decl_140, type, d_24_g: $i > $i).
0.48/0.57	thf(decl_141, type, plus: $i > $i).
0.48/0.57	thf(decl_142, type, n_pl: $i > $i > $i).
0.48/0.57	thf(decl_143, type, d_25_prop1: $i > $i > $i > $o).
0.48/0.57	thf(decl_144, type, d_26_prop1: $i > $i > $o).
0.48/0.57	thf(decl_145, type, d_27_prop1: $i > $i > $o).
0.48/0.57	thf(decl_146, type, d_28_prop1: $i > $i > $i > $o).
0.48/0.57	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.48/0.57	thf(decl_148, type, d_29_ii: $i > $i > $o).
0.48/0.57	thf(decl_149, type, iii: $i > $i > $o).
0.48/0.57	thf(decl_150, type, d_29_prop1: $i > $i > $o).
0.48/0.57	thf(decl_151, type, moreis: $i > $i > $o).
0.48/0.57	thf(decl_152, type, lessis: $i > $i > $o).
0.48/0.57	thf(decl_153, type, esk1_0: $i).
0.48/0.57	thf(decl_154, type, esk2_0: $i).
0.48/0.57	thf(decl_155, type, esk3_2: $i > $i > $i).
0.48/0.57	thf(decl_156, type, esk4_2: $i > $i > $i).
0.48/0.57	thf(decl_157, type, esk5_2: $i > $i > $i).
0.48/0.57	thf(decl_158, type, esk6_2: $i > $i > $i).
0.48/0.57	thf(decl_159, type, esk7_2: $i > $i > $i).
0.48/0.57	thf(decl_160, type, esk8_2: $i > $i > $i).
0.48/0.57	thf(decl_161, type, esk9_1: ($i > $o) > $i).
0.48/0.57	thf(decl_162, type, esk10_2: $i > $i > $i).
0.48/0.57	thf(decl_163, type, esk11_2: $i > $i > $i).
0.48/0.57	thf(decl_164, type, esk12_2: $i > $i > $i).
0.48/0.57	thf(decl_165, type, esk13_2: $i > $i > $i).
0.48/0.57	thf(decl_166, type, esk14_1: $i > $i).
0.48/0.57	thf(decl_167, type, esk15_2: $i > $i > $i).
0.48/0.57	thf(decl_168, type, esk16_2: $i > $i > $i).
0.48/0.57	thf(decl_169, type, esk17_2: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_170, type, esk18_2: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_171, type, epred1_1: $i > $i > $o).
0.48/0.57	thf(decl_172, type, esk19_2: $i > $i > $i).
0.48/0.57	thf(decl_173, type, esk20_2: $i > $i > $i).
0.48/0.57	thf(decl_174, type, esk21_3: $i > ($i > $i) > $i > $i).
0.48/0.57	thf(decl_175, type, esk22_1: ($i > $o) > $i).
0.48/0.57	thf(decl_176, type, epred2_1: $i > $i > $o).
0.48/0.57	thf(decl_177, type, esk23_2: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_178, type, esk24_1: ($i > $o) > $i).
0.48/0.57	thf(decl_179, type, esk25_2: ($i > $o) > ($i > $o) > $i).
0.48/0.57	thf(decl_180, type, epred3_2: ($i > $o) > $i > $i > $o).
0.48/0.57	thf(decl_181, type, epred4_1: $i > $i > $o).
0.48/0.57	thf(decl_182, type, esk26_1: $i > $i).
0.48/0.57	thf(decl_183, type, esk27_2: $i > ($i > $o) > $i).
0.48/0.57	thf(decl_184, type, esk28_2: $i > ($i > $o) > $i).
0.48/0.57	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.48/0.57	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.48/0.57	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.48/0.57	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.48/0.57	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.48/0.57	thf(def_l_some, axiom, ((l_some)=(^[X1:$i, X2:$i > $o]:((d_not @ ((all_of @ (^[X4:$i]:((in @ X4 @ X1))) @ (non @ X1 @ X2))))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.48/0.57	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_diffprop)).
0.48/0.57	thf(def_n_is, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.48/0.57	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_iii)).
0.48/0.57	thf(def_n_some, axiom, ((n_some)=(^[Z0:$i > $o]:((((((![X307:$i]:(((((in @ X307 @ nat)))=>(non @ nat @ Z0 @ X307))))))=>(~($true))))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.48/0.57	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_or)).
0.48/0.57	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_d_29_ii)).
0.48/0.57	thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_lessis)).
0.48/0.57	thf(satz10e, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X245:$i]:((in @ X245 @ nat))) @ (^[X246:$i]:(((lessis @ X1 @ X246)<=(d_not @ ((d_29_ii @ X1 @ X246)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz10e)).
0.48/0.57	thf(satz10k, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X194:$i]:((in @ X194 @ nat))) @ (^[X195:$i]:(((d_29_ii @ X1 @ X195)<=(d_not @ ((lessis @ X1 @ X195)))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz10k)).
0.48/0.57	thf(c_0_15, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.48/0.57	thf(c_0_16, plain, ((is_of)=(^[Z0:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.48/0.57	thf(c_0_17, plain, ((d_not)=(^[Z0:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.48/0.57	thf(c_0_18, plain, ((imp)=(^[Z0:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.48/0.57	thf(c_0_19, plain, ((e_is)=(^[Z0:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.48/0.57	thf(c_0_20, plain, ((l_some)=(^[Z0:$i, Z1:$i > $o]:((((((![X306:$i]:(((((in @ X306 @ Z0)))=>(non @ Z0 @ Z1 @ X306))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_l_some])).
0.48/0.57	thf(c_0_21, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])).
0.48/0.57	thf(c_0_22, plain, ((d_not)=(^[Z0:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_17, c_0_18])).
0.48/0.57	thf(c_0_23, plain, ((diffprop)=(^[Z0:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
0.48/0.57	thf(c_0_24, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_19])).
0.48/0.57	thf(c_0_25, plain, ((l_some)=(^[Z0:$i, Z1:$i > $o]:((((((![X306:$i]:(((((in @ X306 @ Z0)))=>(non @ Z0 @ Z1 @ X306))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
0.48/0.57	thf(c_0_26, plain, ((iii)=(^[Z0:$i, Z1:$i]:((((((![X309:$i]:(((((in @ X309 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))) @ X309))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.48/0.57	thf(c_0_27, plain, ((diffprop)=(^[Z0:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_23, c_0_24])).
0.48/0.57	thf(c_0_28, axiom, ((n_some)=(^[Z0:$i > $o]:((((((![X307:$i]:(((((in @ X307 @ nat)))=>(non @ nat @ Z0 @ X307))))))=>(~($true))))))), inference(apply_def,[status(thm)],[def_n_some, c_0_25])).
0.48/0.57	thf(c_0_29, plain, ((l_or)=(^[Z0:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.48/0.57	thf(c_0_30, plain, ((d_29_ii)=(^[Z0:$i, Z1:$i]:((((((![X308:$i]:(((((in @ X308 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))) @ X308))))))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.48/0.57	thf(c_0_31, plain, ((lessis)=(^[Z0:$i, Z1:$i]:((((((((((((((![X311:$i]:(((((in @ X311 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))) @ X311))))))=>(~($true)))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])).
0.48/0.57	thf(c_0_32, plain, ((iii)=(^[Z0:$i, Z1:$i]:((((((![X309:$i]:(((((in @ X309 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))) @ X309))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
0.48/0.57	thf(c_0_33, plain, ((l_or)=(^[Z0:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29, c_0_18]), c_0_22])).
0.48/0.57	thf(c_0_34, plain, ((d_29_ii)=(^[Z0:$i, Z1:$i]:((((((![X308:$i]:(((((in @ X308 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))) @ X308))))))=>(~($true))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_30, c_0_27]), c_0_28])).
0.48/0.57	thf(c_0_35, plain, ((lessis)=(^[Z0:$i, Z1:$i]:((((((((((((((![X311:$i]:(((((in @ X311 @ nat)))=>(non @ nat @ (^[Z2:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))) @ X311))))))=>(~($true)))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_31, c_0_32]), c_0_24]), c_0_33])).
0.48/0.57	thf(c_0_36, plain, ![X331:$i]:(((in @ X331 @ nat)=>![X330:$i]:(((in @ X330 @ nat)=>(![X329:$i]:(((in @ X329 @ nat)=>(non @ nat @ (^[Z0:$i]:(((X331)=(n_pl @ X330 @ Z0)))) @ X329)))=>(![X328:$i]:(((in @ X328 @ nat)=>(non @ nat @ (^[Z0:$i]:(((X330)=(n_pl @ X331 @ Z0)))) @ X328)))=>((X331)=(X330)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz10e]), c_0_21]), c_0_34]), c_0_35]), c_0_22])])).
0.48/0.57	thf(c_0_37, negated_conjecture, ~(![X315:$i]:(((in @ X315 @ nat)=>![X314:$i]:(((in @ X314 @ nat)=>(~((![X313:$i]:(((in @ X313 @ nat)=>(non @ nat @ (^[Z0:$i]:(((X314)=(n_pl @ X315 @ Z0)))) @ X313)))=>((X315)=(X314))))=>~(![X312:$i]:(((in @ X312 @ nat)=>(non @ nat @ (^[Z0:$i]:(((X315)=(n_pl @ X314 @ Z0)))) @ X312)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz10k])]), c_0_21]), c_0_34]), c_0_35]), c_0_22])])).
0.48/0.57	thf(c_0_38, plain, ![X450:$i, X451:$i]:(((((in @ (esk5_2 @ X450 @ X451) @ nat)|((X450)=(X451))|(in @ (esk4_2 @ X450 @ X451) @ nat)|~(in @ X451 @ nat)|~(in @ X450 @ nat))&(~(non @ nat @ (^[Z0:$i]:(((X451)=(n_pl @ X450 @ Z0)))) @ (esk5_2 @ X450 @ X451))|((X450)=(X451))|(in @ (esk4_2 @ X450 @ X451) @ nat)|~(in @ X451 @ nat)|~(in @ X450 @ nat)))&(((in @ (esk5_2 @ X450 @ X451) @ nat)|((X450)=(X451))|~(non @ nat @ (^[Z0:$i]:(((X450)=(n_pl @ X451 @ Z0)))) @ (esk4_2 @ X450 @ X451))|~(in @ X451 @ nat)|~(in @ X450 @ nat))&(~(non @ nat @ (^[Z0:$i]:(((X451)=(n_pl @ X450 @ Z0)))) @ (esk5_2 @ X450 @ X451))|((X450)=(X451))|~(non @ nat @ (^[Z0:$i]:(((X450)=(n_pl @ X451 @ Z0)))) @ (esk4_2 @ X450 @ X451))|~(in @ X451 @ nat)|~(in @ X450 @ nat))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])])])).
0.48/0.57	thf(c_0_39, negated_conjecture, ![X436:$i, X437:$i]:(((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&(((~(in @ X436 @ nat)|(non @ nat @ (^[Z0:$i]:(((esk2_0)=(n_pl @ esk1_0 @ Z0)))) @ X436))&((esk1_0)!=(esk2_0)))&(~(in @ X437 @ nat)|(non @ nat @ (^[Z0:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))) @ X437)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])).
0.48/0.57	thf(c_0_40, plain, ![X1:$i, X4:$i]:((((X4)=(X1))|(in @ (esk4_2 @ X4 @ X1) @ nat)|~((non @ nat @ (^[Z0:$i]:(((X1)=(n_pl @ X4 @ Z0)))) @ (esk5_2 @ X4 @ X1)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.48/0.57	thf(c_0_41, negated_conjecture, ![X1:$i]:(((non @ nat @ (^[Z0:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))) @ X1)|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_39])).
0.48/0.57	thf(c_0_42, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_39])).
0.48/0.57	thf(c_0_43, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_39])).
0.48/0.57	thf(c_0_44, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_39])).
0.48/0.57	thf(c_0_45, negated_conjecture, ((in @ (esk4_2 @ esk2_0 @ esk1_0) @ nat)|~((in @ (esk5_2 @ esk2_0 @ esk1_0) @ nat))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42]), c_0_43])]), c_0_44])).
0.48/0.57	thf(c_0_46, plain, ![X4:$i, X1:$i]:(((in @ (esk5_2 @ X1 @ X4) @ nat)|((X1)=(X4))|(in @ (esk4_2 @ X1 @ X4) @ nat)|~((in @ X4 @ nat))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.48/0.57	thf(c_0_47, plain, ![X1:$i, X4:$i]:((((X4)=(X1))|~((non @ nat @ (^[Z0:$i]:(((X1)=(n_pl @ X4 @ Z0)))) @ (esk5_2 @ X4 @ X1)))|~((non @ nat @ (^[Z0:$i]:(((X4)=(n_pl @ X1 @ Z0)))) @ (esk4_2 @ X4 @ X1)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.48/0.57	thf(c_0_48, negated_conjecture, ![X1:$i]:(((non @ nat @ (^[Z0:$i]:(((esk2_0)=(n_pl @ esk1_0 @ Z0)))) @ X1)|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_39])).
0.48/0.57	thf(c_0_49, negated_conjecture, (in @ (esk4_2 @ esk2_0 @ esk1_0) @ nat), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_43]), c_0_42])]), c_0_44])).
0.48/0.57	thf(c_0_50, plain, ![X4:$i, X1:$i]:(((in @ (esk5_2 @ X1 @ X4) @ nat)|((X1)=(X4))|~((non @ nat @ (^[Z0:$i]:(((X1)=(n_pl @ X4 @ Z0)))) @ (esk4_2 @ X1 @ X4)))|~((in @ X4 @ nat))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.48/0.57	thf(c_0_51, negated_conjecture, ~((non @ nat @ (^[Z0:$i]:(((esk1_0)=(n_pl @ esk2_0 @ Z0)))) @ (esk5_2 @ esk2_0 @ esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_42]), c_0_43]), c_0_49])]), c_0_44])).
0.48/0.57	thf(c_0_52, negated_conjecture, (in @ (esk5_2 @ esk2_0 @ esk1_0) @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_48]), c_0_43]), c_0_42])]), c_0_44]), c_0_49])])).
0.48/0.57	thf(c_0_53, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_41]), c_0_52])]), ['proof']).
0.48/0.57	# SZS output end CNFRefutation
0.48/0.57	# Parsed axioms                        : 358
0.48/0.57	# Removed by relevancy pruning/SinE    : 273
0.48/0.57	# Initial clauses                      : 137
0.48/0.57	# Removed in clause preprocessing      : 7
0.48/0.57	# Initial clauses in saturation        : 130
0.48/0.57	# Processed clauses                    : 351
0.48/0.57	# ...of these trivial                  : 5
0.48/0.57	# ...subsumed                          : 36
0.48/0.57	# ...remaining for further processing  : 310
0.48/0.57	# Other redundant clauses eliminated   : 15
0.48/0.57	# Clauses deleted for lack of memory   : 0
0.48/0.57	# Backward-subsumed                    : 0
0.48/0.57	# Backward-rewritten                   : 11
0.48/0.57	# Generated clauses                    : 641
0.48/0.57	# ...of the previous two non-redundant : 609
0.48/0.57	# ...aggressively subsumed             : 0
0.48/0.57	# Contextual simplify-reflections      : 0
0.48/0.57	# Paramodulations                      : 618
0.48/0.57	# Factorizations                       : 2
0.48/0.57	# NegExts                              : 0
0.48/0.57	# Equation resolutions                 : 17
0.48/0.57	# Propositional unsat checks           : 0
0.48/0.57	#    Propositional check models        : 0
0.48/0.57	#    Propositional check unsatisfiable : 0
0.48/0.57	#    Propositional clauses             : 0
0.48/0.57	#    Propositional clauses after purity: 0
0.48/0.57	#    Propositional unsat core size     : 0
0.48/0.57	#    Propositional preprocessing time  : 0.000
0.48/0.57	#    Propositional encoding time       : 0.000
0.48/0.57	#    Propositional solver time         : 0.000
0.48/0.57	#    Success case prop preproc time    : 0.000
0.48/0.57	#    Success case prop encoding time   : 0.000
0.48/0.57	#    Success case prop solver time     : 0.000
0.48/0.57	# Current number of processed clauses  : 181
0.48/0.57	#    Positive orientable unit clauses  : 43
0.48/0.57	#    Positive unorientable unit clauses: 0
0.48/0.57	#    Negative unit clauses             : 34
0.48/0.57	#    Non-unit-clauses                  : 104
0.48/0.57	# Current number of unprocessed clauses: 496
0.48/0.57	# ...number of literals in the above   : 2416
0.48/0.57	# Current number of archived formulas  : 0
0.48/0.57	# Current number of archived clauses   : 124
0.48/0.57	# Clause-clause subsumption calls (NU) : 7969
0.48/0.57	# Rec. Clause-clause subsumption calls : 1029
0.48/0.57	# Non-unit clause-clause subsumptions  : 26
0.48/0.57	# Unit Clause-clause subsumption calls : 1479
0.48/0.57	# Rewrite failures with RHS unbound    : 0
0.48/0.57	# BW rewrite match attempts            : 16
0.48/0.57	# BW rewrite match successes           : 10
0.48/0.57	# Condensation attempts                : 351
0.48/0.57	# Condensation successes               : 0
0.48/0.57	# Termbank termtop insertions          : 47584
0.48/0.57	
0.48/0.57	# -------------------------------------------------
0.48/0.57	# User time                : 0.069 s
0.48/0.57	# System time              : 0.005 s
0.48/0.57	# Total time               : 0.074 s
0.48/0.57	# Maximum resident set size: 3632 pages
0.48/0.57	
0.48/0.57	# -------------------------------------------------
0.48/0.57	# User time                : 0.076 s
0.48/0.57	# System time              : 0.011 s
0.48/0.57	# Total time               : 0.086 s
0.48/0.57	# Maximum resident set size: 2260 pages
0.48/0.57	EOF